Study on Quantum Zero Knowledge Proof System
نویسندگان
چکیده
Zero-knowledge proof is a very interesting problem in modern cryptography, which attracts the attention of many cryptographers, and there are plenty of researches. It is one of the hot research field in cryptography. First, we made a simple introduction of zero-knowledge proof. Then we had given a perfect quantum zero knowledge proof system on a specific NP – complete problem "graph 3-coloring"( G3C ). And we use reduction structure to promote any NP – complete problem. At last, we introduced the applications of zero knowledge proof in cryptography.
منابع مشابه
imits on the Power of Quantum Statistical Zero-Knowledge
In this paper we propose a definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZKHV . We prove several facts regarding this class, including: The following problem is a complete promise problem for QSZKHV : given instructions for preparing two mixed quantum states, are the states close together...
متن کاملLimits on the power of quantum statistical zero-knowledge
In this paper we propose a definition for honest verifier quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZKHV. We prove several facts regarding this class, including: • The following problem is a complete promise problem for QSZKHV: given instructions for preparing two mixed quantum states, are the states close together o...
متن کاملQuantum statistical zero-knowledge
In this paper we propose a definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZK. We prove several facts regarding this class: • The following natural problem is a complete promise problem for QSZK: given instructions for preparing two mixed quantum states, are the states close together or far...
متن کاملPost-quantum Security of Fiat-Shamir
The Fiat-Shamir construction (Crypto 1986) is an efficient transformation in the random oracle model for creating non-interactive proof systems and signatures from sigmaprotocols. In classical cryptography, Fiat-Shamir is a zero-knowledge proof of knowledge assuming that the underlying sigma-protocol has the zero-knowledge and special soundness properties. Unfortunately, Ambainis, Rosmanis, and...
متن کاملOracle Separations for Quantum Statistical Zero-Knowledge
This paper investigates the power of quantum statistical zero knowledge interactive proof systems in the relativized setting. We prove the existence of an oracle relative to which quantum statistical zero knowledge does not contain UP ∩ coUP, and we prove that quantum statistical zero knowledge does not contain UP relative to a random oracle with probability 1. Our proofs of these statements re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013